A Semantically Enhanced Knowledge Discovery Method for Knowledge Graph Based on Adjacency Fuzzy Predicates Reasoning
نویسندگان
چکیده
Discover the deep semantics from massively structured data in knowledge graph and provide reasonable explanations are a series of important foundational research issues artificial intelligence. However, hidden between entities cannot be well expressed. Moreover, considering many predicates express fuzzy relationships, existing reasoning methods effectively deal with these interpret corresponding process. To counter above problems, this article, new interpretable schema is proposed by introducing theory. The presented method focuses on analyzing semantic related graph. By annotating features adjacency predicates, novel model designed to realize extension over evaluation, based both visualization query experiments, shows that proposal has advantages initial can discover more valid information.
منابع مشابه
Deductive and Analogical Reasoning on a Semantically Embedded Knowledge Graph
Representing knowledge as high-dimensional vectors in a continuous semantic vector space can help overcome the brittleness and incompleteness of traditional knowledge bases. We present a method for performing deductive reasoning directly in such a vector space, combining analogy, association, and deduction in a straightforward way at each step in a chain of reasoning, drawing on knowledge from ...
متن کاملSemantically Smooth Knowledge Graph Embedding
This paper considers the problem of embedding Knowledge Graphs (KGs) consisting of entities and relations into lowdimensional vector spaces. Most of the existing methods perform this task based solely on observed facts. The only requirement is that the learned embeddings should be compatible within each individual fact. In this paper, aiming at further discovering the intrinsic geometric struct...
متن کاملDeepPath: A Reinforcement Learning Method for Knowledge Graph Reasoning
We study the problem of learning to reason in large scale knowledge graphs (KGs). More specifically, we describe a novel reinforcement learning framework for learning multi-hop relational paths: we use a policy-based agent with continuous states based on knowledge graph embeddings, which reasons in a KG vector space by sampling the most promising relation to extend its path. In contrast to prio...
متن کاملApproaches to Parallel Graph-Based Knowledge Discovery
The large amount of data collected today is quickly overwhelming researchers' abilities to interpret the data and discover interesting patterns. Knowledge discovery and data mining systems contain the potential to automate the interpretation process, but these approaches frequently utilize computationally expensive algorithms. In particular, scientific discovery systems focus on the utilization...
متن کاملGraph-Based Knowledge Discovery: Compression versus Frequency
There are two primary types of graph-based data miners: frequent subgraph and compression-based miners. With frequent subgraph miners, the most interesting substructure is the largest one (or ones) that meet the minimum support. Whereas, compression-based graph miners discover those subgraphs that maximize the amount of compression that a particular substructure provides a graph. The algorithms...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal on Semantic Web and Information Systems
سال: 2023
ISSN: ['1552-6291', '1552-6283']
DOI: https://doi.org/10.4018/ijswis.323921